n=int(input())
k=5
while n>k:
n -= k
k *= 2
k=k//5
if n%k==0:
x=n//k
else:
x=n//k+1
if x==1:
print("Sheldon")
elif x==2:
print("Leonard")
elif x==3:
print("Penny")
elif x==4:
print("Rajesh")
else:
print("Howard")#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define PB push_back
#define yes cout<<"YES"<<endl;
#define no cout<<"NO"<<endl;
#define all(X) (X).begin(),(X).end()
#define Reverse(X) reverse(all(X))
#define maxe(A,n) *max_element(A,A+n)
#define mine(A,n) *min_element(A,A+n)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*(b/gcd(a,b)))
#define Unique(X) (X).erase(unique((X).begin(),(X).end()),(X).end())
const ll N=1.5*1e5+100;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n; cin>>n;
string s[]={"Sheldon", "Leonard", "Penny", "Rajesh", "Howard"};
ll Double=1;
while(Double*5<n)
{
n-=Double*5;
Double*=2;
}
n--;
n/=Double;
cout<<s[n]<<endl;
} 1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |